Malicious Hashing: Eve's Variant of SHA-1
نویسندگان
چکیده
We present collisions for a version of SHA-1 with modified constants, where the colliding payloads are valid binary files. Examples are given of colliding executables, archives, and images. Our malicious SHA-1 instances have round constants that differ from the original ones in only 40 bits (on average). Modified versions of cryptographic standards are typically used on closed systems (e.g., in pay-TV, media and gaming platforms) and aim to differentiate cryptographic components across customers or services. Our proof-of-concept thus demonstrates the exploitability of custom SHA-1 versions for malicious purposes, such as the injection of user surveillance features. To encourage further research on such malicious hash functions, we propose definitions of malicious hash functions and of associated security notions.
منابع مشابه
Malicious Keccak
In this paper, we investigate Keccak — the cryptographic hash function adopted as the SHA-3 standard. We propose a malicious variant of the function, where new round constants are introduced. We show that for such the variant, collision and preimage attacks are possible. We also identify a class of weak keys for the malicious Keccak working in the MAC mode. Ideas presented in the paper were ver...
متن کاملAdvanced SHA-1 Algorithm Ensuring Stronger Data Integrity
SHA-1 is a widely used cryptographic hashing algorithm for validating the integrity of data. Until recently, SHA-1 was considered to be the most secure hashing algorithm and also remains the most widely used hashing function till date. In this paper, we review various collision search attacks on the original full 80-step SHA-1 algorithm and present a new optimized version of the algorithm that ...
متن کاملPerformance Comparison of Parallel Implementations of Cayley and SHA Hash Functions
Implementing hash functions to run on multi-core computers will reduce its running time. We aim to implement Cayley, SHA-256 and SHA-512 hash functions to run on multicore computers and compare their performances. Cayley hash compresses the input message by hashing one bit at a time using composition of linear equations. SHA-256 and SHA-512 work on message blocks and produce fixed length digest...
متن کاملData Tastes Better Seasoned: Introducing the ASH Family of Hashing Algorithms
Over the recent months it has become clear that the current generation of cryptographic hashing algorithms are insufficient to meet future needs. The ASH family of algorithms provides modifications to the existing SHA-2 family. These modifications are designed with two main goals: 1) Providing increased collision resistance. 2) Increasing mitigation of security risks post-collision. The unique ...
متن کاملHardware Performance Evaluation of SHA-3 Candidate Algorithms
Secure Hashing Algorithms (SHA) showed a significant importance in today’s information security applications. The National Institute of Standards and Technology (NIST), held a competition of three rounds to replace SHA1 and SHA2 with the new SHA-3, to ensure long term robustness of hash functions. In this paper, we present a comprehensive hardware evaluation for the final round SHA-3 candidates...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2014 شماره
صفحات -
تاریخ انتشار 2014